Randomness extractors -- applications and constructions
نویسنده
چکیده
Randomness extractors are efficient algorithms which convert weak random sources into nearly perfect ones. While such purification of randomness was the original motivation for constructing extractors, these constructions turn out to have strong pseudorandom properties which found applications in diverse areas of computer science and combinatorics. We will highlight some of the applications, as well as recent constructions achieving near-optimal extraction.
منابع مشابه
Recent Developments in Explicit Constructions of Extractors
Extractors are functions which are able to “extract” random bits from arbitrary distributions which “contain” sufficient randomness. Explicit constructions of extractors have many applications in complexity theory and combinatorics. This manuscript is a survey of recent developments in extractors and focuses on explicit constructions of extractors following Trevisan’s breakthrough result [Tre99].
متن کاملAn Introduction to Randomness Extractors
We give an introduction to the area of “randomness extraction” and survey the main concepts of this area: deterministic extractors, seeded extractors and multiple sources extractors. For each one we briefly discuss background, definitions, explicit constructions and applications.
متن کاملExtracting Randomness: A Survey and New Constructions
Extractors are Boolean functions that allow, in some precise sense, extraction of randomness from somewhat random distributions, using only a small amount of truly random bits. Extractors, and the closely related ``dispersers,'' exhibit some of the most ``random-like'' properties of explicitly constructed combinatorial structures. In this paper we do two things. First, we survey extractors and ...
متن کاملRandomness Extractors – An Exposition
Randomness is crucial to computer science, both in theory and applications. In complexity theory, randomness augments computers to offer more powerful models. In cryptography, randomness is essential for seed generation, where the computational model used is generally probabilistic. However, ideal randomness, which is usually assumed to be available in computer science theory and applications, ...
متن کاملExtracting Randomness: How and Why - A survey - Computational Complexity, 1996. Proceedings., Eleventh Annual IEEE Conference on
Extractors are boolean functions that allow, in some precise sense, extraction o f randomness from somewhat random distributions. Extractors, and the closely related “Dispersers”, exhibit some of the most “random-like” properties of explicitly constructed combinatorial structures. In turn, extractors and dispersers have many applications in “removing randomness” in various settings, and in maki...
متن کامل